Quantum automorphism groups of vertex-transitive graphs of order ≤ 11
نویسندگان
چکیده
منابع مشابه
Quantum automorphism groups of vertex - transitive graphs of order ≤ 11
We study quantum automorphism groups of vertex-transitive graphs having less than 11 vertices. With one possible exception, these can be obtained from cyclic groups Zn , symmetric groups Sn and quantum symmetric groups Qn , by using various product operations. The exceptional case is that of the Petersen graph, and we present some questions about it.
متن کاملQuantum Automorphism Groups of Vertex-transitive Graphs of Order ≤ 11 Teodor Banica and Julien Bichon
We study quantum automorphism groups of vertex-transitive graphs having less than 11 vertices. With one possible exception, these can be obtained from cyclic groups Zn, symmetric groups Sn and quantum symmetric groups Qn, by using various product operations. The exceptional case is that of the Petersen graph, and we present some questions about it.
متن کامل3 1 Ja n 20 06 QUANTUM AUTOMORPHISM GROUPS OF VERTEX - TRANSITIVE GRAPHS OF ORDER ≤ 11
We study quantum automorphism groups of vertex-transitive graphs having less than 11 vertices. With one possible exception, these can be obtained from cyclic groups Zn, symmetric groups Sn and quantum symmetric groups Qn, by using various product operations. The exceptional case is that of the Petersen graph, and we present some questions about it.
متن کاملAUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...
متن کامل2 2 N ov 2 00 6 QUANTUM AUTOMORPHISM GROUPS OF VERTEX - TRANSITIVE GRAPHS OF ORDER ≤ 11
We study quantum automorphism groups of vertex-transitive graphs having less than 11 vertices. With one possible exception, these can be obtained from cyclic groups Zn, symmetric groups Sn and quantum symmetric groups Qn, by using various product operations. The exceptional case is that of the Petersen graph, and we present some questions about it.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebraic Combinatorics
سال: 2007
ISSN: 0925-9899,1572-9192
DOI: 10.1007/s10801-006-0049-9